منابع مشابه
Correctness proof of a geometric constraint solver
We present a correctness proof of a graph-directed variational geometric constraint solver. First, we prove that the graph reduction that establishes the sequence in which to apply the construction steps de nes a terminating con uent reduction system, in the case of well-constrained graphs. For overconstrained problems there may not be a unique normal form. Underconstrained problems, on the oth...
متن کاملA Rule-Constructive Geometric Constraint Solver
This work reports on the implementation of a two-dimensional, varia-tional geometric constraint solver based on a constructive approach. The solver computes a solution in two phases. First, using rewrite rules, the solver builds a sequence of construction steps. Then, the construction steps are carried out to generate an instance of the geometric object for the current dimension values. We disc...
متن کاملA Geometric Constraint Solver with Decomposable Constraint Set
$EVWUDFW ,Q WKH SDSHU D QHZ FRQVWUXFWLYH DSSURDFK WR VROYLQJ JHRPHWULF FRQVWUDLQWV LQ ' VSDFH LV SUHVHQWHG 7KH PDLQ VWHS RI WKH DOJRULWKP LV SUH SURFHVVLQJ ZKLFK WUDQVIRUPV ERWK JHRPHWULF HOHPHQWV DQG JHRPHWULF FRQVWUDLQWV LQWR VLPSOHU IRUPV DQG DGGV UHGXQGDQW FRQVWUDLQWV RI GLVWDQFHV DQG DQJOHV E\ VROYLQJ WULDQJOHV DQG GHWHUPLQLQJ VXPV DQG GLIIHUHQFHV RI DGMDFHQW DQJOHV $ ZLGH YDULHW\ RI ZHOO ...
متن کاملA Geometric Relaxation Solver for Parametric Constraint-Based Models
In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iter...
متن کاملA 2D geometric constraint solver using a graph reduction method
Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the desig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design
سال: 1995
ISSN: 0010-4485
DOI: 10.1016/0010-4485(94)00013-4